Some order dimension bounds for communication complexity problems
نویسندگان
چکیده
منابع مشابه
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cylinder. ii) Given two n-point sets in Rd, decide whether they can be separated by two hyperplanes. iii) Given a system of n linear inequalities with d variables, find a maximum-size feasible subsystem. We show that (the...
متن کاملOn the Complexity of Some Geometric Problems in Unbounded Dimension
This paper examines the complexity of several geometric problems due to un bounded dimension The problems considered are i minimum cover of points by unit cubes ii minimum cover of points by unit balls and iii minimum number of lines to hit a set of balls Each of these problems is proven not to have a poly nomial approximation scheme unless P NP Speci c lower bounds on the error ratios attainab...
متن کاملSome Bounds on Communication Complexity of Gap Hamming Distance
In this paper we obtain some bounds on communication complexity of Gap Hamming Distance problem (GHDnL,U ): Alice and Bob are given binary string of length n and they are guaranteed that Hamming distance between their inputs is either ≤ L or ≥ U for some L < U . They have to output 0, if the first inequality holds, and 1, if the second inequality holds. In this paper we study the communication ...
متن کاملVC Dimension Bounds for Higher-Order Neurons
We investigate the sample complexity for learning using higher-order neurons. We calculate upper and lower bounds on the Vapnik-Chervonenkis dimension and the pseudo dimension for higher-order neurons that allow unrestricted interactions among the input variables. In particular, we show that the degree of interaction is irrelevant for the VC dimension and that the individual degree of the varia...
متن کاملUpper Bounds on the Complexity of Some Galois Theory Problems
Assuming the generalized Riemann hypothesis, we prove the following complexity bounds: The order of the Galois group of an arbitrary polynomial f(x) ∈ Z[x] can be computed in P#P. Furthermore, the order can be approximated by a randomized polynomial-time algorithm with access to an NP oracle. For polynomials f with solvable Galois group we show that the order can be computed exactly by a random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1991
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf01463947